runtime.timers.heap (field)

51 uses

	runtime (current package)
		proc.go#L6200: 		if len(pp.timers.heap) > 0 {
		proc.go#L6549: 			print(" runqsize=", t-h, " gfreecnt=", pp.gFree.size, " timerslen=", len(pp.timers.heap), "\n")
		time.go#L138: 	heap []timerWhen
		time.go#L194: 	ts.len.Store(uint32(len(ts.heap)))
		time.go#L291: 	if ts == nil || t != ts.heap[0].timer {
		time.go#L306: 		ts.heap[0].when = t.when
		time.go#L462: 	ts.heap = append(ts.heap, timerWhen{t, t.when})
		time.go#L463: 	ts.siftUp(len(ts.heap) - 1)
		time.go#L464: 	if t == ts.heap[0].timer {
		time.go#L547: 	t := ts.heap[0].timer
		time.go#L552: 	last := len(ts.heap) - 1
		time.go#L554: 		ts.heap[0] = ts.heap[last]
		time.go#L556: 	ts.heap[last] = timerWhen{}
		time.go#L557: 	ts.heap = ts.heap[:last]
		time.go#L772: 		if len(ts.heap) == 0 {
		time.go#L788: 		n := len(ts.heap)
		time.go#L789: 		if t := ts.heap[n-1].timer; t.astate.Load()&timerZombie != 0 {
		time.go#L795: 				ts.heap[n-1] = timerWhen{}
		time.go#L796: 				ts.heap = ts.heap[:n-1]
		time.go#L802: 		t := ts.heap[0].timer
		time.go#L830: 	if len(src.heap) > 0 {
		time.go#L834: 		for _, tw := range src.heap {
		time.go#L844: 		src.heap = nil
		time.go#L849: 		ts.len.Store(uint32(len(ts.heap)))
		time.go#L930: 	for i := 0; i < len(ts.heap); i++ {
		time.go#L931: 		tw := &ts.heap[i]
		time.go#L950: 			n := len(ts.heap)
		time.go#L951: 			ts.heap[i] = ts.heap[n-1]
		time.go#L952: 			ts.heap[n-1] = timerWhen{}
		time.go#L953: 			ts.heap = ts.heap[:n-1]
		time.go#L1035: 	if len(ts.heap) > 0 {
		time.go#L1037: 		for len(ts.heap) > 0 {
		time.go#L1075: 	if len(ts.heap) == 0 {
		time.go#L1078: 	tw := ts.heap[0]
		time.go#L1272: 	for i, tw := range ts.heap {
		time.go#L1280: 		if tw.less(ts.heap[p]) {
		time.go#L1281: 			print("bad timer heap at ", i, ": ", p, ": ", ts.heap[p].when, ", ", i, ": ", tw.when, "\n")
		time.go#L1285: 	if n := int(ts.len.Load()); len(ts.heap) != n {
		time.go#L1286: 		println("timer heap len", len(ts.heap), "!= atomic len", n)
		time.go#L1295: 	if len(ts.heap) == 0 {
		time.go#L1298: 		ts.minWhenHeap.Store(ts.heap[0].when)
		time.go#L1353: 	heap := ts.heap
		time.go#L1377: 	heap := ts.heap
		time.go#L1418: 	if len(ts.heap) <= 1 {
		time.go#L1421: 	for i := int(uint(len(ts.heap)-1-1) / timerHeapN); i >= 0; i-- {